Quantitative and Stream Extensions of Answer Set Programming

نویسندگان

چکیده

Answer Set Programming has separately been extended with constraints, to the streaming domain, and capabilities reason over quantities associated answer sets. We propose introduction analysis of a general framework that incorporates all three directions extension by exploiting strengths Here-and-There Logic Weighted Logic.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extensions of Answer Set Programming

We discuss a number of possible extensions of Answer Set Programming. The four formalisms we investigate are: 1. logic programs where the negative parts of the bodies in clauses can be replaced by arbitrary constraints which we call Arbitrary Constraint Logic Programming (ACLP), 2. logic programs where we are allowed arbitrary set constraint atoms, 3. logic programs where atoms represent sets f...

متن کامل

Extensions of Answer Set Programming

This paper describes a doctoral research in three areas: Hybrid ASP – an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expect...

متن کامل

Integrating Temporal Extensions of Answer Set Programming

In this paper we study the relation between the two main extensions of Answer Set Programming with temporal modal operators: Temporal Equilibrium Logic (TEL) and Temporal Answer Sets (TAS). On the one hand, TEL is a complete non-monotonic logic that results from the combination of Linear-time Temporal Logic (LTL) with Equilibrium Logic. On the other hand, TAS is based on a richer modal approach...

متن کامل

Epistemic Extensions of Answer Set Programming

Answer Set Programming (ASP) is a declarative programming language based on the stable model semantics and geared towards solving complex combinatorial problems. The strength of ASP stems from the use of a non-monotonic operator. This operator allows us to retract previously made conclusions as new information becomes available. Similarly, in commonsense reasoning, we may arrive at conclusions ...

متن کامل

Answer Set Programming for Stream Reasoning

This paper explores Answer Set Programming (ASP) for stream reasoning with data retrieved continuously from sensors. We describe a proof-of-concept with an example of using declarative models to recognize car on-road situations.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic proceedings in theoretical computer science

سال: 2021

ISSN: ['2075-2180']

DOI: https://doi.org/10.4204/eptcs.345.43